Complex scale-free networks with tunable power-law exponent and clustering

نویسندگان

  • Ewan R. Colman
  • Geoff J. Rodgers
چکیده

We introduce a network evolution process motivated by the network of citations in the scientific literature. In each iteration of the process a node is born and directed links are created from the new node to a set of target nodes already in the network. This set includes m “ambassador” nodes and l of each ambassador’s descendants where m and l are random variables selected from any choice of distributions pl and qm. The process mimics the tendency of authors to cite varying numbers of papers included in the bibliographies of the other papers they cite. We show that the degree distributions of the networks generated after a large number of iterations are scale-free and derive an expression for the power-law exponent. In a particular case of the model where the number of ambassadors is always the constant m and the number of selected descendants from each ambassador is the constant l, the power-law exponent is (2l + 1)/l. For this example we derive expressions for the degree distribution and clustering coefficient in terms of l and m. We conclude that the proposed model can be tuned to have the same power law exponent and clustering coefficient of a broad range of the scale-free distributions that have been studied empirically.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense Power-law Networks and Simplicial Complexes

There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e. their degree distributions follow P (k) ∝ k−γ with γ ∈ (1, 2]. Models of growing networks have been successfully employed to produce scale-free networks using preferential attachment, however these...

متن کامل

Packet transport and load distribution in scale-free network models

In scale-free networks, the degree distribution follows a power law with the exponent . Many model networks exist which reproduce the scale-free nature of the real-world networks. In most of these models, the value of is continuously tunable, thus is not universal. We study a problem of data packet transport in scale-free networks and de/ne load at each vertex as the accumulated total number of...

متن کامل

O ct 2 00 2 Classification of scale free networks

While the emergence of a power law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent η which is robust and use it to classify the scale-free networks. We have observed two universality classes with η ≈ 2.2(1) and 2.0, respectively. Real world networks for th...

متن کامل

Power-law strength-degree correlation from resource-allocation dynamics on weighted networks.

Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explained. We investigate the dynamic behavior of resource-traffic flow on scale-free networks. The dynamical system will evolve into a kinetic equilibrium state, where the strength, defined by the amount of resource or traffic load, is correlated w...

متن کامل

Classification of scale-free networks.

While the emergence of a power-law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the between ness centrality displays a power-law distribution with an exponent eta, which is robust, and use it to classify the scale-free networks. We have observed two universality classes with eta approximately equal 2.2(1) and 2.0, respectively. R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1307.7389  شماره 

صفحات  -

تاریخ انتشار 2013